Scatter Search: Basic Design and Advanced Strategies
نویسندگان
چکیده
منابع مشابه
Scatter Search: Basic Design and Advanced Strategies
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first proposed in the 1970s and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The combination strategy was devised with the belief that information could be exploited mo...
متن کاملScatter Search and Path Relinking: Foundations and Advanced Designs
Scatter Search and its generalized form Path Relinking, are evolutionary methods that have been successfully applied to hard optimization problems. Unlike genetic algorithms, they operate on a small set of solutions and employ diversification strategies of the form proposed in Tabu Search, which give precedence to strategic learning based on adaptive memory, with limited recourse to randomizati...
متن کاملMixed network design using hybrid scatter search
This research proposes a bi-level model for the mixed network design problem (MNDP). The upper level problem involves redesigning the current road links' directions, expanding their capacity, and determining signal settings at intersections to optimize the reserve capacity of the whole system. The lower level problem is the user equilibrium traffic assignment problem. By proving that the optima...
متن کاملAn advanced scatter search design for skull-face overlay in craniofacial superimposition
Craniofacial superimposition is a forensic identification technique where photographs or video shots of a missing person are compared with a skull found in order to determine whether that is the same person. The second stage of this complex forensic process, named skull-face overlay, aims to achieve the best overlay of the skull 3D model and the 2D image of the face. In this paper, we aim to pr...
متن کاملAdvanced Scatter Search for the Max-Cut Problem
The Max-Cut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights between both sets is maximized. This is an NP-hard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed since the 1970s and applied to a variety of fields, particularly in engineering and layout design...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTELIGENCIA ARTIFICIAL
سال: 2003
ISSN: 1988-3064,1137-3601
DOI: 10.4114/ia.v7i19.720